Strong functors and interleaving fixpoints in game semantics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong functors and interleaving fixpoints in game semantics

We describe a sequent calculus μLJ with primitives for inductive and co-inductive datatypes and equip it with reduction rules allowing a sound translation of Gödel’s system T. We introduce the notion of a μ-closed category, relying on a uniform interpretation of open μLJ formulas as strong functors. We show that any μ-closed category is a sound model for μLJ . We then turn to the construction o...

متن کامل

Least and Greatest Fixpoints in Game Semantics

We show how solutions to many recursive arena equations can be computed in a natural way by allowing loops in arenas. We then equip arenas with winning functions and total winning strategies. We present two natural winning conditions compatible with the loop construction which respectively provide initial algebras and terminal coalgebras for a large class of continuous functors. Finally, we int...

متن کامل

Preferential Semantics for Causal Fixpoints

In this paper we concentrate on the causal theory of action developed by McCain and Turner 2] for computing ramiications. Our aim here is to characterise this theory of action in terms of a preferential-style semantics in the spirit of Shoham 4]. Such a result would not only place McCain and Turner's theory in a uniform setting, facilitating comparison with other logics of action, but also give...

متن کامل

Strong Functors and Monoidal Monads

In [4] we proved that a commutative monad on a symmetric monoidal closed category carries the structure of a symmetric monoidal monad ([4], Theorem 3.2). We here prove the converse, so that, taken together, we have: there is a 1-1 correspondence between commutative monads and symmetric monoidal monads (Theorem 2.3 below). The main computational work needed consists in constructing an equivalenc...

متن کامل

Normal Functors and Strong Protomodularity

The notion of normal subobject having an intrinsic meaning in any protomodular category, we introduce the notion of normal functor, namely left exact conservative functor which reflects normal subobjects. The point is that for the category Gp of groups the change of base functors, with respect to the fibration of pointed objects, are not only conservative (this is the definition of a protomodul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 2013

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita/2012028